Locking is used as the concurrency control mechanism 鎖定可以用作并發(fā)控制機(jī)制。
There is no specific concurrency control mechanism available 沒有可以使用的特定的并發(fā)控制機(jī)制。
Operations , as not all classes need such a concurrency control mechanism 操作外面加上鎖,因?yàn)椴皇撬蓄惗夹枰@種并發(fā)控制機(jī)制。
In this thesis , concurrency control mechanism is studied in depth which is used when multiple users access sharing data simultaneously . access control mechanism is also discussed 本文深入研究協(xié)同設(shè)計中的多個用戶同時訪問共享資源時所采用的并發(fā)控制機(jī)制,并對訪問控制機(jī)制進(jìn)行了探討。
4 . concurrency control system implementation corresponding to the collaborative design model , a concurrency control system is designed and implemented partly to apply the concurrency control mechanism discussed above to support collaborative design ( 4 )并發(fā)控制系統(tǒng)實(shí)現(xiàn)針對所提出的協(xié)同模型,運(yùn)用所研究的并發(fā)控制機(jī)制,設(shè)計和部分實(shí)現(xiàn)了一個支持協(xié)同設(shè)計的并發(fā)控制系統(tǒng)。
In this paper , we discuss the theories and the implemention method of concurrency control , present a new multilevel transaction model - - - nhstm and apply this model to the concurrency control mechanism for nhsdb , a multilevel security dbms prototype 本文對安全數(shù)據(jù)庫并發(fā)控制理論和實(shí)現(xiàn)方法進(jìn)行討論,提出了nhstm多級事務(wù)模型,并將該模型應(yīng)用于nhsdb多級安全數(shù)據(jù)庫的并發(fā)控制機(jī)制中。
This paper decomposes materialized views maintenance into ods / db interface and dw / ods interface . multiple data sources with concurrent updates may result in update anomalies of the materialized views . so at ods / db interface this paper introduces an improved nested transaction model - based transaction concurrency control mechanism to maintenance views in ods on line 本文把視圖的一致性維護(hù)問題分解到三層結(jié)構(gòu)的ods / dw和dw / ods兩個接口上分別實(shí)現(xiàn),并且引入視圖生成樹的概念,在ods / db接口處采用基于改進(jìn)嵌套事務(wù)模型的并發(fā)控制機(jī)制,聯(lián)機(jī)維護(hù)ods的數(shù)據(jù),大大提高了視圖維護(hù)過程中的并發(fā)度和靈活性。
We analysis the conflict , convert channel and starvation problems of concurrent schedule based on strict - 2pl locking protocal which applies nhstm model , then present a concurrent scheduling algorithm making use of buffer and point p . also , we proved the concurrent schedule algorithm is serializable . at the same time , we introduce the key technical used in nhsdb concurrency control mechanism , and give the implementation details 我們對應(yīng)用nhstm模型的,通過應(yīng)用嚴(yán)格兩段鎖協(xié)議實(shí)施的并發(fā)調(diào)度中,可能存在的并發(fā)沖突,隱通道和饑餓問題進(jìn)行分析,在此基礎(chǔ)上提出了一種利用緩沖和p點(diǎn)的并發(fā)調(diào)度算法,并給出了該算法的并發(fā)調(diào)度正確性證明,解決多級安全條件下的隱通道和饑餓問題。